Weather forecasting using Convex hull & K-Means Techniques An Approach
نویسندگان
چکیده
Data mining is a popular concept of mined necessary data from a large set of data. Data mining using clustering is a powerful way to analyze data and gives prediction. In this paper non structural time series data is used to forecast daily average temperature, humidity and overall weather conditions of Kolkata city. The air pollution data have been taken from West Bengal Pollution Control Board to build the original dataset on which the prediction approach of this paper is studied and applied. This paper describes a new technique to predict the weather conditions using convex hull which gives structural data and then apply incremental K-means to define the appropriate clusters. It splits the total database into four separate databases with respect to different weather conditions. In the final step, the result will be calculated on the basis of priority based protocol which is defined based on some mathematical deduction. Keyword—weather database, clustering, convex-hull, K-means, Threshold;
منابع مشابه
Weather Forecasting using Incremental K-means Clustering
Clustering is a powerful tool which has been used in several forecasting works, such as time series forecasting, real time storm detection, flood forecasting and so on. In this paper, a generic methodology for weather forecasting is proposed by the help of incremental K-means clustering algorithm. Weather forecasting plays an important role in day to day applications.Weather forecasting of this...
متن کاملAn Algorithm to Identify Robust Convective Weather Avoidance Polygons in En Route Airspace
The paper describes an algorithm for constructing convective weather avoidance polygons. The algorithm combines weather avoidance fields (WAF) from the en route convective weather avoidance model (CWAM) with edges automatically detected in the echo tops field, clustering, convex hull fitting and wind data to build weather avoidance polygons. Results for 2 case days with significantly different ...
متن کاملJust Relax and Come Clustering! A Convexification of k-Means Clustering, Report no. LiTH-ISY-R-2992
k-means clustering is a popular approach to clustering. It is easy to implement and intuitive but has the disadvantage of being sensitive to initialization due to an underlying non-convex optimization problem. In this paper, we derive an equivalent formulation of k-means clustering. The formulation takes the form of a `0-regularized least squares problem. We then propose a novel convex, relaxed...
متن کاملShape-Based Features for Cat Ganglion Retinal Cells Classification
T his article presents a quantitative and objective approach to cat ganglion cell characterization and classification. The combination of several biologically relevant features such as diameter, eccentricity, fractal dimension, influence histogram, influence area, convex hull area, and convex hull diameter are derived from geometrical transforms and then processed by three different clustering ...
متن کاملCombination of Transformed-means Clustering and Neural Networks for Short-Term Solar Radiation Forecasting
In order to provide an efficient conversion and utilization of solar power, solar radiation datashould be measured continuously and accurately over the long-term period. However, the measurement ofsolar radiation is not available to all countries in the world due to some technical and fiscal limitations. Hence,several studies were proposed in the literature to find mathematical and physical mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.06456 شماره
صفحات -
تاریخ انتشار 2014